An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem in Graph Theory
نویسندگان
چکیده
The connected vertex cover (CVC) problem is a variant of the vertex cover problem, 1 which has many important applications, such as wireless network design, routing and wavelength 2 assignment problem, etc. A good algorithm for the problem can help us improve engineering 3 efficiency, cost savings and resources in industrial applications. In this work, we present an efficient 4 algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex 5 Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase 6 and local search phase. To construct a high quality feasible initial solution, we design a greedy 7 function and a restricted candidate list in the construction phase. The configuration checking strategy 8 is adopted to decrease the cycling problem in the local search phase. The experimental results 9 demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate 10 the effectivity and efficiency of our GRASP-CVC solver. 11
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملA New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks
Given a graph G = (V, E), a dominating set D is a subset of V such that any vertex not in D is adjacent to at least one vertex in D. Efficient algorithms for computing the minimum connected dominating set (MCDS) are essential for solving many practical problems, such as finding a minimum size backbone in ad hoc networks. Wireless ad hoc networks appear in a wide variety of applications, includi...
متن کاملFinding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess
The problem of finding a minimum vertex cover (MinVC) in a graph is a well known NPhard combinatorial optimization problem of great importance in theory and practice. Due to its NP-hardness, there has been much interest in developing heuristic algorithms for finding a small vertex cover in reasonable time. Previously, heuristic algorithms for MinVC have focused on solving graphs of relatively s...
متن کاملA 2-approximation NC algorithm for connected vertex cover and tree cover
The connected vertex cover problem is a variant of the vertex cover problem, in which a vertex cover is additional required to induce a connected subgraph in a given connected graph. The problem is known to be NP-hard and to be at least as hard to approximate as the vertex cover problem is. While several 2-approximation NC algorithms are known for vertex cover, whether unweighted or weighted, n...
متن کاملEfficient bounds for the stable set, vertex cover and set packing problems
A cover in a graph G is a set of vertices C such that each edge of G has at least one endpoint in C. The vertex cover problem is the problem of finding a cover of the smallest weight in a graph whose vertices carry positive weights. This problem is known to be NP-complete even when the input is restricted to planar cubic graphs with unit weights [8]. A stable set in a graph is a set of pairwise...
متن کامل